Stabilized explicit $$u-p_w$$ solution in soil dynamic problems near the undrained-incompressible limit
نویسندگان
چکیده
Abstract Traditionally, Biot’s formulation is employed to model the behavior of saturated soils. The $$u-p_w$$ u - p w (solid displacement–pore water pressure) can be considered as standard one, since involves a good computational performance together with excellent accuracy for slow and moderate speed phenomena. Dynamic processes studied even if acceleration neglected, what occurs in undrained limit. It well-known that might display instabilities undrained-incompressible Several techniques have been proposed overcome this issue, principally within an implicit time integration scheme small strains. In paper, robust implementation divergence momentum equation technique presented explicit approach framework optimal transportation meshfree at finite strain. examples are provided order assess methodology.
منابع مشابه
Procedures for solving spectral/hp stabilized incompressible flow problems
In this paper we implement the element-by-element preconditioner and inexact Newton-Krylov methods (developed in the past) for solving stabilized computational fluid dynamics (CFD) problems with spectral methods. Two different approaches are implemented for speeding up the process of solving both steady and unsteady incompressible Navier-Stokes equations. The first approach concerns the applica...
متن کاملgenetic algorithm based on explicit memory for solving dynamic problems
nowadays, it is common to find optimal point of the dynamic problem; dynamic problems whose optimal point changes over time require algorithms which dynamically adapt the search space instability. in the most of them, the exploitation of some information from the past allows to quickly adapt after an environmental change (some optimal points change). this is the idea underlining the use of memo...
متن کاملExplicit stabilized integration of stiff determinisitic or stochastic problems
Explicit stabilized methods for stiff ordinary differential equations have a long history. Proposed in the early 1960s and developed during 40 years for the integration of stiff ordinary differential equations, these methods have recently been extended to implicit-explicit or partitioned type methods for advection-diffusion-reaction problems, and to efficient explicit solvers for stiff mean-squ...
متن کاملSolution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environment, the user or other agents in the framework of a distributed system. In this context, computing a new solution from scratch after each problem change is possible, but has two important drawbacks: inefficiency and i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Geotechnica
سال: 2022
ISSN: ['1861-1125', '1861-1133']
DOI: https://doi.org/10.1007/s11440-022-01642-1